Fast modulo 2n+1 multi-operand adders and residue generators

نویسندگان

  • Haridimos T. Vergos
  • Dimitris Bakalis
  • Costas Efstathiou
چکیده

In this manuscript novel architectures for modulo 2 þ 1 multi-operand addition and residue generation are introduced. The proposed arithmetic components consist of a translation stage, an inverted endaround-carry carry-save-adder tree and an enhanced diminished-1 modulo 2 þ 1 adder. Qualitative and quantitative results indicate that the proposed architectures result in significantly faster and in several cases smaller circuits than the previously proposed. & 2009 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Modulo 2n +1 Adder Design

Efficient modulo 2+1 adders are important for several applications including residue number system, digital signal processors and cryptography algorithms. In this paper we present a novel modulo 2+1 addition algorithm for a recently represented number system. The proposed approach is introduced for the reduction of the power dissipated. In a conventional modulo 2+1 adder, all operands have (n+1...

متن کامل

Improved Modulo 2n +1 Adder Design

Efficient modulo 2+1 adders are important for several applications including residue number system, digital signal processors and cryptography algorithms. In this paper we present a novel modulo 2+1 addition algorithm for a recently represented number system. The proposed approach is introduced for the reduction of the power dissipated. In a conventional modulo 2+1 adder, all operands have (n+1...

متن کامل

RNS - to - Binary Converter for New Four - Moduli Set { 2 n − 1 , 2 n , 2 n + 1 − 1 , 2 n + 1 + 2 n − 1 } ∗

In this paper, a new four-moduli set {2n − 1, 2n, 2n+1 − 1, 2n+1 + 2n − 1} is proposed. The new moduli set choice because of a fast modulo 2n+1 + 2n − 1 adder has been proposed in literature. In order to work out the reverse converter for this moduli set, we introduce the technique for modulo 2n+1+2n−1 of a negative number and modulo 2n+1+2n−1 multiplication of a residue number by 2 and design ...

متن کامل

High Speed Parallel-Prefix Modulo 2n+1 Adders for Diminished-One Operands

We present a new methodology for designing modulo 2"+1 adders with operands in the diminished-one number system. The proposed methodology leads lo parallel-prejix adder implementations. Both an analytical model and V U 1 implementations in a standard-cell technology are utilized for comparing the adders designed following the proposed methodology against the existing solutions. Our results indi...

متن کامل

A Residue to Binary Converter for the {2n + 2, 2n + 1, 2n} Moduli Set

In this paper, we investigate Residue Number System (RNS) to decimal conversion for a three moduli set with a common factor. We propose a new RNS to binary converter for the moduli set {2n + 2, 2n + 1, 2n} for any even integer n > 0. First, we demonstrate that for such a moduli set, the computation of the multiplicative inverses can be eliminated. Secondly, we simplify the Chinese Remainder The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Integration

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2010